Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5
نویسنده
چکیده
We give complete sequent-like tableau systems for the modal logics KB, KDB, K5, and KD5. Analytic cut rules are used to obtain the completeness. The systems have the analytic superformula property and can thus give a decision procedure.
منابع مشابه
Sequent-like Tableau Systems with the Analytic Superformula Property for the Modal Logics
We give complete sequent-like tableau systems for the modal logics KB , KDB , K5, and KD5. Analytic cut rules are used to obtain the completeness. The systems have the analytic superformula property and can thus give a decision procedure.
متن کاملAnalytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5
We give complete sequent-like tableau systems for the modal logics KB , KDB , K5, and KD5. Analytic cut rules are used to obtain the completeness. Our systems have the analytic superformula property and can thus give a decision procedure. Using the systems, we prove the Craig interpolation lemma for the mentioned logics.
متن کاملClausal Tableau Systems and Space Bounds for the Modal Logics
We propose so called clausal tableau systems for the common modal logics K , KD , T , KB , KDB and B . There is a measure such that for each tableau rule of these systems the measure of all its denominators is smaller than the measure of its numerator. Basing on these systems, we give a decision procedure for the logics, which uses O(n)-space for the logics T , KB , KDB and B , and O(n. logn)-s...
متن کاملConstructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P , where L can be one of the modal logics KD, T , KDB, B, KD4, S4, KD5, KD45, and S5. If L ∈ {KD5,KD45, S5}, or L ∈ {KD,T,KDB,B} and the modal depth of P is finitely bounded, then the least L-model of P can be constructed in PTIME and coded in polynomial space. We also show that if P has no flat models t...
متن کاملThe Modal Query Language MDatalog
We propose a modal query language called MDatalog. A rule of an MDatalog program is a universally quantified modal Horn clause. This language is interpreted in fixed-domain first-order modal logics over signatures without functions. We give algorithms to construct the least models for MDatalog programs. We show PTIME complexity of computing queries for a given MDatalog program in the logics KD,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000